//https://leetcode.cn/problems/kth-largest-element-in-an-array/
class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int> p_queue(nums.begin(), nums.end());
        for (int i = 1; i <= k; i++)
        {
            if (i == k) return p_queue.top();
            else p_queue.pop();
        }
        return 0;
    }
};